Research on Motion Detection and Target Contour Extraction in Wearable Video System.

Topic aspect analysis for multi%2Ddocument summarization.

Document update summarization using incremental hierarchical clustering.

Using Analog Network Coding to Improve the RFID Reading Throughput.

The Study on Application Value of EVA in Enterprise Performance Evaluation.

Data %22Audit%22 Research Based on the Accounting Information System.

The Study on Application Value of EVA in Enterprise Performance Evaluation.

Energy Efficient Algorithms for the RFID Estimation Problem.

Using data mining techniques to address critical information exchange needs in disaster affected public%2Dprivate networks.

Automatic malware categorization using cluster ensemble.

Identifying the missing tags in a large RFID system.

Bridging Domains with Words Opinion Analysis with Matrix Tri%2Dfactorizations.

Bridging Domains with Words Opinion Analysis with Matrix Tri%2Dfactorizations.

Feature subset non%2Dnegative matrix factorization and its applications to document understanding.

Many are better than one improving multi%2Ddocument summarization via weighted consensus.
Given a collection of documents, various multi-document summarization methods have been proposed to generate a short summary. However, few studies have been reported on aggregating different summarization methods to possibly generate better summarization results. We propose a weighted consensus summarization method to combine the results from single summarization systems. Experimental results on DUC2004 data sets demonstrate the performance improvement by aggregating multiple summarization systems, and our proposed weighted consensus summarization method outperforms other combination methods.
Ontology%2Denriched multi%2Ddocument summarization in disaster management.
In this poster, we propose a novel document summarization approach named Ontology-enriched M ulti-Document Summarization(OMS) for utilizing background knowledge to improve summarization results. OMS first maps the sentences of input documents onto an ontology, then links the given query to a specific node in the ontology, and finally extracts the summary from the sentences in the subtree rooted at the query node. By using the domain-related ontology, OMS can better capture the semantic relevance between the query and the sentences, and thus lead to better summarization results. As a byproduct, the final summary generated by OMS can be represented as a tree showing the hierarchical relationships of the extracted sentences. Evaluation results on the collection of press releases by Miami-Dade
VisualSum an interactive multi%2Ddocument summarizationsystem using visualization.


HCC a hierarchical co%2Dclustering algorithm.


Wavelet Methods in Data Mining.
Recently there has been significant development in the use of wavelet methods in various Data Mining processes. This article presents general overview of their applications in Data Mining. It first presents a high-level data-mining framework in which the overall process is divided into smaller components. It reviews a p plications of wavelets for each component. It discusses the impact of wavelets on Data Mining research and outlines potential future research directions and applications. Keywords:
On combining multiple clusterings an overview and a new perspective.

Improved stability analysis on delayed neural networks with linear fractional uncertainties.

Convex and Semi%2DNonnegative Matrix Factorizations.
We present several new variations on the theme of nonnegative matrix factorization (NMF). Considering factorizations of the form X = F G T, we focus on algorithms in which G is restricted to contain nonnegative entries, but allow the data matrix X to have mixed signs, thus extending the applicable range of NMF methods. We also consider algorithms in which the basis vectors of F are constrained to be convex combinations of the data points. This is used for a kernel extension of NMF. We provide algorithms for computing these new factorizations and we provide supporting theoretical analysis. We also analyze the relationships between our algorithms and clustering algorithms, and consider the implications for sparseness of solutions. Finally, we present experimental results that explore the properties of these new methods. 1
Binary matrix factorization for analyzing gene expression data.

Convex and Semi%2DNonnegative Matrix Factorizations.
We present several new variations on the theme of nonnegative matrix factorization (NMF). Considering factorizations of the form X = F G T, we focus on algorithms in which G is restricted to contain nonnegative entries, but allow the data matrix X to have mixed signs, thus extending the applicable range of NMF methods. We also consider algorithms in which the basis vectors of F are constrained to be convex combinations of the data points. This is used for a kernel extension of NMF. We provide algorithms for computing these new factorizations and we provide supporting theoretical analysis. We also analyze the relationships between our algorithms and clustering algorithms, and consider the implications for sparseness of solutions. Finally, we present experimental results that explore the properties of these new methods. 1


Feature Selection for Gene Expression Using Model%2DBased Entropy.
Abstract—Gene expression data usually contain a large number of genes, but a small number of samples. Feature selection for gene expression data aims at finding a set of genes that best discriminate biological samples of different types. Using machine learning techniques, traditional gene selection based on empirical mutual information suffers the data sparseness issue due to the small number of samples. To overcome the sparseness issue, we propose a model-based approach to estimate the entropy of class variables on the model, instead of on the data themselves. Here, we use multivariate normal distributions to fit the data, because multivariate normal distributions have maximum entropy among all real-valued distributions with specified mean and standard deviation, and are widely used to approximate various distributions. Given that the data follow a multivariate normal distribution, since the conditional distribution of class variables given the selected features is normal distribution, its entropy can be computed with the log-determinant of its covariance matrix. Because of the large number of genes, the computation of all possible log-determinants is not efficient. We propose several algorithms to largely reduce the computational cost. The experiments on seven gene datasets and the comparison with other five approaches show the accuracy of the multivariate Gaussian generative model for feature selection, and the efficiency of our algorithms.
LIBGS A MATLAB software package for gene selection.
Abstract: Many gene selection algorithms have been applied in microarray expression data analysis successfully. To solve different developing environments of these toolkits, perform data analysis and algorithm comparison more flexible, we have developed a software package LIBGS including: rankgene (Su et al., 2003), and mRMR
Ordinal%2DClass Core Vector Machine.

Full%2Dchip leakage analysis for 65 nm CMOS technology and beyond.

Ordinal%2DClass Core Vector Machine.



Selecting profitable custom instructions for reconfigurable processors.

Survey of data management and analysis in disaster situations.

Data clustering with size constraints.

Improved stability criteria of neural networks with time%2Dvarying delays An augmented LKF approach.



Proceedings of the 2nd ACM SIGKDD Workshop on Data Mining using Matrices and Tensors

Efficient Heuristic Algorithm for Rapid Custom%2DInstruction Selection.

Photodynamic Therapy of New Amphiphilic Phthalocyanine Zinc Inhibits the Proliferation of Human Hepatoma Bel%2D7402 Cells through the Induction of Apoptosis.

Fast enumeration of maximal valid subgraphs for custom%2Dinstruction identification.

Quantized consensus over expander networks and communication energy minimization.

Robust stability analysis on discrete%2Dtime Cohen%2DGrossberg neural networks with distributed delay.

Comparative document summarization via discriminative sentence selection.
Given a collection of document groups, a quick question is what are the differences in these groups. In this paper, we study a novel problem of summarizing the differences between document groups. A discriminative sentence selection method is proposed to extract the most discriminative sentences which represent the specific characteristics of each document group. Experiments on real world data sets demonstrate the effectiveness of our proposed method.
Comparative document summarization via discriminative sentence selection.
Given a collection of document groups, a quick question is what are the differences in these groups. In this paper, we study a novel problem of summarizing the differences between document groups. A discriminative sentence selection method is proposed to extract the most discriminative sentences which represent the specific characteristics of each document group. Experiments on real world data sets demonstrate the effectiveness of our proposed method.
Research on Distributed Database Application for Integrated Urban Underground Pipelines.

A Multi%2Dobjective Optimization Evolutionary Algorithm Addressing Diversity Maintenance.

Beyond the graphs Semi%2Dparametric semi%2Dsupervised discriminant analysis.

Exploiting Domain Knowledge by Automated Taxonomy Generation in Recommender Systems.

K%2DSubspace Clustering.
Abstract. The widely used K-means clustering deals with ball-shaped (spherical Gaussian) clusters. In this paper, we extend the K-means clustering to accommodate extended clusters in subspaces, such as lineshaped clusters, plane-shaped clusters, and ball-shaped clusters. The algorithm retains much of the K-means clustering flavors: easy to implement and fast to converge. A model selection procedure is incorporated to determine the cluster shape. As a result, our algorithm can recognize a wide range of subspace clusters studied in various literatures, and also the global ball-shaped clusters (living in all dimensions). We carry extensive experiments on both synthetic and real-world datasets, and the results demonstrate the effectiveness of our algorithm. 1
Application Study of PS%2DDInSAR Technique Fusing Multi%2Dmetadata in Urban Ground Deformation Survey.



Two Heads Better Than One Metric Active Learning and its Applications for IT Service Classification.

Maximum Margin Clustering on Data Manifolds.

Non%2Dnegative Laplacian Embedding.

Semi%2Dsupervised Multi%2Dtask Learning with Task Regularizations.

A New Intrusion Detection Method Based on Antibody Concentration.

Knowledge Transformation by Cross%2DDomain Belief Propagation.
Abstract—Belief propagation is an iterative algorithm for computing marginals of functions on a graphical model most commonly used in information retrieval. In this paper, we consider the problem of performing cross-domain belief propagation on multi-relational data for semi-supervised learning. We demonstrate that partial knowledge on one type of variables can help knowledge discovery on the other type of variables with cross-domain belief propagation by utilizing the existing relationships in multi-relation data. For example, in a worddocument data set, information on the word domain can effectively enhance the labeling of document domain. In this paper, we explore this new area, knowledge transformation of multi-relation data for semi-supervised learning tasks. We show that partial knowledge on one data variable domain can help knowledge discovery on the other variable domain with crossdomain belief propagation by utilizing the existing relationships in multi-relation data. The experimental results on several real world data sets are presented to show the effectiveness of our method. I.
A New Intrusion Detection Method Based on Antibody Concentration.

Label Propagation on K%2Dpartite Graphs.

Weighted Consensus Clustering for Identifying Functional Modules in Protein%2DProtein Interaction Networks.

TransMetric architecture independent workload characterization for transactional memory benchmarks.

On the %28dis%29similarity of transactional memory workloads.

Generalized Cluster Aggregation.
Clustering aggregation has emerged as an important extension of the classical clustering problem. It refers to the situation in which a number of different (input) clusterings have been obtained for a particular data set and it is desired to aggregate those clustering results to get a better clustering solution. In this paper, we propose a unified framework to solve the clustering aggregation problem, where the aggregated clustering result is obtained by minimizing the (weighted) sum of the Bregman divergence between it and all the input clusterings. Moreover, under our algorithm framework, we also propose a novel cluster aggregation problem where some must-link and cannot-link constraints are given in addition to the input clusterings. Finally the experimental results on some real world data sets are presented to show the effectiveness of our method. 1
Preference Learning with Extreme Examples.
In this paper, we consider a general problem of semi-supervised preference learning, in which we assume that we have the information of the extreme cases and some ordered constraints, our goal is to learn the unknown preferences of the other places. Taking the potential housing place selection problem as an example, we have many candidate places together with their associated information (e.g., position, environment), and we know some extreme examples (i.e. several places are perfect for building a house, and several places are the worst that cannot build a house there), and we know some partially ordered constraints (i.e. for two places, which place is better), then how can we judge the preference of one potential place whose preference is unknown beforehand? We propose a Bayesian framework based on Gaussian process to tackle this problem, from which we not only solve for the unknown preferences, but also the hyperparameters contained in our model. 1
M3IC Maximum Margin Multiple Instance Clustering.
Clustering, classification, and regression, are three major research topics in machine learning. So far, much work has been conducted in solving multiple instance classification and multiple instance regression problems, where supervised training patterns are given as bags and each bag consists of some instances. But the research on unsupervised multiple instance clustering is still limited. This paper formulates a novel Maximum Margin Multiple Instance Clustering (M 3 IC) problem for the multiple instance clustering task. To avoid solving a nonconvex optimization problem directly, M 3 IC is further relaxed, which enables an efficient optimization solution with a combination of Constrained Concave-Convex Procedure (CCCP) and the Cutting Plane method. Furthermore, this paper analyzes some important properties of the proposed method and the relationship between the proposed method and some other related ones. An extensive set of empirical results demonstrate the advantages of the proposed method against existing research for both effectiveness and efficiency. 1
Fit a Spread Estimator in Small Memory.
Abstract—The spread of a source host is the number of distinct destinations that it has sent packets to during a measurement period. A spread estimator is a software/hardware module on a router that inspects the arrival packets and estimates the spread of each source. It has important applications in detecting port scans and DDoS attacks, measuring the infection rate of a worm, assisting resource allocation in a server farm, determining popular web contents for caching, to name a few. The main technical challenge is to fit a spread estimator in a fast but small memory (such as SRAM) in order to operate it at the line speed in a high-speed network. In this paper, we design a new spread estimator that delivers good performance in tight memory space where all existing estimators no longer work. The new estimator not only achieves space compactness but operates more efficiently than the existing ones. Its accuracy and efficiency come from a new method for data storage, called virtual vectors, which allow us to measure and remove the errors in spread estimation. We perform experiments on real Internet traces to verify the effectiveness of the new estimator. I.
Research on Logging Evaluation of Reservoir Contamination Based on PSO%2DBP Neural Network.

The Application of EDI Technology in Electronic Commerce System.

Intelligent file scoring system for malware detection from the gray list.

Accurate
Much work has been done on the statistical analysis of text. In some cases reported in the literature, inappropriate statistical methods have been used, and statistical significance of results have not been addressed. In particular, asymptotic normality assumptions have often been used unjustifiably, leading to flawed results.This assumption of normal distribution limits the ability to analyze rare events. Unfortunately rare events do make up a large fraction of real text.However, more applicable methods based on likelihood ratio tests are available that yield good results with relatively small samples. These tests can be implemented efficiently, and have been used for the detection of composite terms and for the determination of domain-specific terms. In some cases, these measures perform much better than the methods previously used. In cases where traditional contingency table methods work well, the likelihood ratio tests described here are nearly identical.This paper describes the basis of a measure based on likelihood ratios that can be applied to the analysis of text.
TransPlant A parameterized methodology for generating transactional memory workloads.

Characterizing and mitigating the impact of process variations on phase change based memory systems.

Exploring Phase Change Memory and 3D Die%2DStacking for Power%2FThermal Friendly

Research experiences for undergraduates autonomic computing research at FIU.

Integrated KL %28K%2Dmeans %2D Laplacian%29 Clustering A New Clustering Approach by Combining Attribute Data and Pairwise Relations.

Evolutionary document summarization for disaster management.
In this poster, we develop an evolutionary document summarization system for discovering the changes and differences in each phase of a disaster evolution. Given a collection of document streams describing an event, our system generates a short summary delivering the main development theme of the event by extracting the most representative and discriminative sentences at each phase. Experimental results on the collection of press releases for Hurricane Wilma in 2005 demonstrate the efficacy of our proposal.
Knowledge transformation for cross%2Ddomain sentiment classification.

Mining product reviews based on shallow dependency parsing.

Thermal Design Space Exploration of 3D Die Stacked Multi%2Dcore Processors Using Geospatial%2DBased Predictive Models.

A Dynamic Programming Model about Optimized Port Transport Expense Paper.

The Application of Saftey Audit and Monitor Technology in Power Management.

OrdRank Learning to Rank with Ordered Multiple Hyperplanes.

Optimal selections of orthodontic mini%2Dimplant diameter and length by biomechanical consideration A three%2Ddimensional finite element analysis.

Mean square average%2Dconsensus under measurement noises and fixed topologies Necessary and sufficient conditions.

Addressing Diverse User Preferences A Framework for Query Results Navigation.
Database queries are often exploratory and users often find their queries return too many answers, many of them irrelevant. Existing approaches include categorization, ranking, and query refinement. The success of all these approaches depends on the utilization of user preferences. However, most existing work assumes that all users have the same user preferences, but in real life different users often have different preferences. In this paper, we propose a framework that addresses diverse user preferences in query results navigation. 1
Clustering with Local and Global Regularization.
Clustering is an old research topic in data mining and machine learning communities. Most of the traditional clustering methods can be categorized local or global ones. In this paper, a novel clustering method that can explore both the local and global information in the dataset is proposed. The method, Clustering with Local and Global Consistency (CLGR), aims to minimize a cost function that properly trades off the local and global costs. We will show that such an optimization problem can be solved by the eigenvalue decomposition of a sparse symmetric matrix, which can be done efficiently by some iterative methods. Finally the experimental results on several datasets are presented to show the effectiveness of our method.
Music Recommendation Based on Acoustic Features and User Access Patterns.
Abstract—Music recommendation is receiving increasing attention as the music industry develops venues to deliver music over the Internet. The goal of music recommendation is to present users lists of songs that they are likely to enjoy. Collaborative-filtering and content-based recommendations are two widely used approaches that have been proposed for music recommendation. However, both approaches have their own disadvantages: collaborative-filtering methods need a large collection of user history data and content-based methods lack the ability of understanding the interests and preferences of users. To overcome these limitations, this paper presents a novel dynamic music similarity measurement strategy that utilizes both content features and user access patterns. The seamless integration of them significantly improves the music similarity measurement accuracy and performance. Based on this strategy, recommended songs are obtained by a means of label propagation over a graph representing music similarity. Experimental results on a real data set collected from
Novel Stability Criteria on Discrete%2DTime Neural Networks with Both Time%2DVarying and Distributed Delays.

Constrained discrete%2Dtime PI controller design for output PDFs of stochastic systems with time delays.

SBMDS an interpretable string based malware detection system using SVM ensemble with bagging.
SBMDS: an interpretable string based malware detection system using SVM ensemble with bagging
Distributed agents model for intrusion detection based on AIS.

Adaptive neural control for a class of output feedback time delay nonlinear systems.

Robust stability of stochastic Cohen%2DGrossberg neural networks with mixed time%2Dvarying delays.

marginFace A novel face recognition method by average neighborhood margin maximization.

KDD2009 workshop report DMMT%2709 data mining using matrices and tensors.

Sampled%2Ddata based average consensus with measurement noises convergence analysis and uncertainty principle.

Characteristics%2Dbased effective applause detection for meeting speech.

The Sixth International Conference on Machine Learning and Applications

Semi%2Dsupervised Classification Using Local and Global Regularization.

Multi%2DView Local Learning.

A Novel Detection Method of Filled Pause in Mandarin Spontaneous Speech.

A Novel Immune Based Approach for Detection of Windows PE Virus.

Building a Scalable P2P Network with Small Routing Delay.

Improving Transductive Support Vector Machine by Ensembling.

Managing multi%2Dcore soft%2Derror reliability through utility%2Ddriven cross domain optimization.

Improving Transductive Support Vector Machine by Ensembling.

Integrating clustering and multi%2Ddocument summarization to improve document understanding.
Document understanding techniques such as document clustering and multi-document summarization have been receiving much attention in recent years. Current document clustering methods usually represent documents as a term-document matrix and perform clustering algorithms on it. Although these clustering methods can group the documents satisfactorily, it is still hard for people to capture the meanings of the documents since there is no satisfactory interpretation for each document cluster. In this paper, we propose a new language model to simultaneously cluster and summarize the documents. By utilizing the mutual influence of the document clustering and summarization, our method makes (1) a better document clustering method with more meaningful interpretation and (2) a better document summarization method taking the document context information into consideration.
Semi%2Dsupervised metric learning by maximizing constraint margin.

Clustering multi%2Dway data via adaptive subspace iteration.

Cooperation Controlled Competitive Learning Approach for Data Clustering.
Rival Penalized Competitive Learning (RPCL) and its variants can perform clustering analysis efficiently with the ability of selecting the cluster number automatically. Although they have been widely applied in a variety of research areas, some of their problems have not yet been solved. Based on the semi-competitive learning mechanism of Competitive and Cooperative Learning (CCL), this paper presents a new robust learning algorithm named Cooperation Controlled Competitive Learning (CCCL), in which the learning rate of each seed points within the same cooperative team can be adjusted adaptively. CCCL has not only inherited the merits of CCL, RPCL and its variants, but also overcome most of their shortcomings. It is insensitive to the initialization of the seed points and applicable to the heterogeneous clusters with an attractive accurate convergence property. Experiments have shown the efficacy of CCCL. Moreover, in some case its performance is prior to CCL and some other variants of RPCL.
Archer A Community Distributed Computing Infrastructure for Computer Architecture Research and Education.

Full%2Dchip leakage analysis in nano%2Dscale technologies mechanisms

Towards a business continuity information network for rapid disaster recovery.
Crisis Management and Disaster Recovery have gained immense importance in the wake of recent man and nature inflicted
Combined circuit and microarchitecture techniques for effective soft error robustness in SMT processors.

Labeling Nodes of Automatically Generated Taxonomy for Multi%2Dtype Relational Datasets.

An Efficient Fuzzy Kohonen Clustering Network Algorithm.

Modular Neural Network Structure with Fast Training%2FRecognition Algorithm for Pattern Recognition.

Anatomy of a Real%2DTime Intrusion Prevention System.
Host intrusion prevention systems for both servers and end-hosts must address the dual challenges of accuracy and performance. Researchers have mostly focused on addressing the former challenge, suggesting solutions based either on exploit-based penetration detection or anomaly-based misbehavior detection, but yet stopping short of comprehensive solutions that leverage merits of both approaches. The second challenge, however, is rarely addressed; doing so comprehensively is important for practical usability, since these systems can introduce substantial overhead and cause system slowdown, more so when the system load is high. We present Rootsense, a holistic and real-time intrusion prevention system that combines the merits of misbehavior-based and anomaly-based detection. Four principles govern
On Virtualizing Ethernet Switches.
Abstract — We are interested in exploring how to virtualize network switches in order to create multiple logical switches from one physical switch. The motivation behind this is to be able to support multiple research-and-education (R&amp;E) projects by offering each of them a logical switch that could coexist with other R&amp;E projects ’ logical switches, so that each would have the equivalent of their own switch. We propose an approach for virtualizing off-the-shelf Ethernet switches that have builtin support for creating isolated bandwidth partitions on their data-plane interfaces. Our solution is to implement two software modules that are run external to the switches, a slice scheduler and a Slice Administration Controller (SAC). We applied our approach to virtualizing a specific Ethernet switch, i.e., the Force10 E600 model. We describe our implementation, and show how a slowdown of 3 % to 26%, based on the type of administrative command issued, is experienced when using the SAC. I.
Compromised Sensor Nodes Detection A Quantitative Approach.

Nonnegative Matrix Factorization for Combinatorial Optimization Spectral Clustering

HIREL An Incremental Clustering Algorithm for Relational Datasets.

An FSM%2DBased Approach for Malicious Code Detection Using the Self%2DRelocation Gene.

Computer Virus Evolution Model Inspired by Biological DNA.

Optimizing Issue Queue Reliability to Soft Errors on Simultaneous Multithreaded Architectures.

Accelerating multi%2Dcore processor design space evaluation using automatic multi%2Dthreaded workload synthesis.

Adaptive dynamic neuro%2Dfuzzy system for traffic signal control.

Numerical Simulation of Water%2DFilling Process in Long%2DDistance Diversion Tunnel with Free Flow.

Cancelable Voiceprint Templates Based on Knowledge Signatures.

An Immune Multi%2Dagent System for Network Intrusion Detection.

A Novel Biology%2DInspired Virus Detection Model with RVNS.


A Dynamic Immunity%2DBased Model for Computer Virus Detection.


Stability Criteria with Less Variables for Neural Networks with Time%2DVarying Delay.

Full%2DChip Leakage Verification for Manufacturing Considering Process Variations.

Simultaneous tensor subspace selection and clustering the equivalence of high order svd and k%2Dmeans clustering.


Modeling and Analyzing the Effect of Microarchitecture Design Parameters on Microprocessor Soft Error Vulnerability.

NBTI tolerant microarchitecture design in the presence of process variation.



Using Analytical Models to Efficiently Explore Hardware Transactional Memory and Multi%2DCore Co%2DDesign.

ORBIT Effective Issue Queue Soft%2DError Vulnerability Mitigation on Simultaneous Multithreaded Architectures Using Operand Readiness%2DBased Instruction Dispatch.

Semi%2DSupervised Clustering via Matrix Factorization.
The recent years have witnessed a surge of interests of semi-supervised clustering methods, which aim to cluster the data set under the guidance of some supervisory information. Usually those supervisory information takes the form of pairwise constraints that indicate the similarity/dissimilarity between the two points. In this paper, we propose a novel matrix factorization based approach for semi-supervised clustering. In addition, we extend our algorithm to co-cluster the data sets of different types with constraints. Finally the experiments on UCI data sets and real world Bulletin Board Systems (BBS) data sets show the superiority of our proposed method.
Weighted Consensus Clustering.
Consensus clustering has emerged as an important extension of the classical clustering problem. We propose weighted consensus clustering, where each input clustering is weighted and the weights are determined in such a way that the final consensus clustering provides a better quality solution, in which clusters are better separated comparing to standard consensus clustering. Theoretically, we show that a reformulation of the wellknown L1 regularization LASSO problem is equivalent to the weight optimization of our weighted consensus clustering, and thus our approach provides sparse solutions which may resolve the difficult situation when the input clusterings diverge significantly. We also show that the weighted consensus clustering resolves the redundancy problem when many input clusterings correlate highly. Detailed algorithms are given. Experiments are carried out to demonstrate the effectiveness of the weighted consensus clustering.

Multi%2Ddocument summarization via sentence%2Dlevel semantic analysis and symmetric matrix factorization.
Multi-document summarization aims to create a compressed summary while retaining the main characteristics of the original set of documents. Many approaches use statistics and machine learning techniques to extract sentences from documents. In this paper, we propose a new multi-document summarization framework based on sentence-level semantic analysis and symmetric non-negative matrix factorization. We first calculate sentence-sentence similarities using semantic analysis and construct the similarity matrix. Then symmetric matrix factorization, which has been shown to be equivalent to normalized spectral clustering, is used to group sentences into clusters. Finally, the most informative sentences are selected from each group to form the summary. Experimental results on DUC2005 and DUC2006 data sets demonstrate the improvement of our proposed framework over the implemented existing summarization systems. A further study on the factors that benefit the high performance is also conducted.
Author%2Dtopic evolution analysis using three%2Dway non%2Dnegative Paratucker.

Posterior probabilistic clustering using NMF.

Quantify music artist similarity based on style and mood.

Simplified exponential stability analysis for recurrent neural networks with discrete and distributed time%2Dvarying delays.

Decentralized tracking%2Dtype games for multi%2Dagent systems with coupled ARX models Asymptotic Nash equilibria.

Archer A Community Distributed Computing Infrastructure for Computer Architecture Research and Education

On the equivalence between Non%2Dnegative Matrix Factorization and Probabilistic Latent Semantic Indexing.

Guest editorial special issue on temporal data mining theory

Guest Editors%27 Introduction Interaction of Many%2DCore Computer Architecture and Operating Systems.

Beyond Single%2DPage Web Search Results.
Abstract—Given a user keyword query, current Web search engines return a list of individual Web pages ranked by their “goodness” with respect to the query. Thus, the basic unit for search and retrieval is an individual page, even though information on a topic is often spread across multiple pages. This degrades the quality of search results, especially for long or uncorrelated (multitopic) queries (in which individual keywords rarely occur together in the same document), where a single page is unlikely to satisfy the user’s information need. We propose a technique that, given a keyword query, on the fly generates new pages, called composed pages, which contain all query keywords. The composed pages are generated by extracting and stitching together relevant pieces from hyperlinked Web pages and retaining links to the original Web pages. To rank the composed pages, we consider both the hyperlink structure of the original pages and the associations between the keywords within each page. Furthermore, we present and experimentally evaluate heuristic algorithms to efficiently generate the top composed pages. The quality of our method is compared to current approaches by using user surveys. Finally, we also show how our techniques can be used to perform query-specific summarization of Web pages. Index Terms—Internet search, search process, Web search.
Further Results on Delay%2DDependent Stability Criteria of Neural Networks With Time%2DVarying Delays.

Joint Erasure Marking and List Viterbi Algorithm for Decoding in Unknown Non%2DGaussian Noise.

Joint Erasure Marking and Viterbi Decoding Algorithm for Unknown Impulsive Noise Channels.

Text categorization via generalized discriminant analysis.

Lmi%2DBased asymptotic Stability Analysis of Neural Networks with Time%2DVarying Delays.

An intelligent PE%2Dmalware detection system based on association mining.
Abstract The proliferation of malware has presented a serious threat to the security of computer systems. Traditional signature-based anti-virus systems fail to detect polymorphic/metamorphic and new, previously unseen malicious executables. Data mining methods such as Naive Bayes and Decision Tree have been studied on small collections of executables. In this paper, resting on the analysis of Windows APIs called by PE files, we develop the Intelligent Malware Detection System (IMDS) using Objective-Oriented Association (OOA) mining based classification. IMDS is an integrated system consisting of three major modules: PE parser, OOA rule generator, and rule based classifier. An OOA_Fast_FP-Growth algorithm is adapted to efficiently generate OOA rules for classification. A comprehensive experimental study on a large collection of PE files obtained from the anti-virus laboratory of KingSoft Corporation is A short version of the paper is appeared in [33]. The work is partially supported by NSF IIS-0546280 and an IBM Faculty Research Award. The authors would also like to thank the members in the anti-virus laboratory at KingSoft Corporation for their helpful discussions and suggestions.
Clustering based on matrix approximation a unifying view.

Delay%2Ddependent fault detection and diagnosis using B%2Dspline neural networks and nonlinear filters for time%2Ddelay stochastic systems.

Stability analysis of Cohen%2DGrossberg neural networks with time%2Dvarying and distributed delays.

Corrigendum to %22Exponential state estimation for recurrent neural networks with distributed delays%22 %5BNeurocomputing 71%281%2D3%29 %282007%29 428%2D438%5D.
We present conditional random fields, a framework for building probabilistic models to segment and label sequence data. Conditional random fields offer several advantages over hidden Markov models and stochastic grammars for such tasks, including the ability to relax strong independence assumptions made in those models. Conditional random fields also avoid a fundamental limitation of maximum entropy Markov models (MEMMs) and other discriminative Markov models based on directed graphical models, which can be biased towards states with few successor states. We present iterative parameter estimation algorithms for conditional random fields and compare the performance of the resulting models to HMMs and MEMMs on synthetic and natural-language data. 1.
Dynamic active probing of helpdesk databases.
Helpdesk databases are used to store past interactions between customers and companies to improve customer service quality. One common scenario of using helpdesk database is to find whether recommendations exist given a new problem from a customer. However, customers often provide incomplete or even inaccurate information. Manually preparing a list of clarification questions does not work for large databases. This paper investigates the problem of automatic generation of a minimal number of questions to reach an appropriate recommendation. This paper proposes a novel dynamic active probing method. Compared to other alternatives such as decision tree and case-based reasoning, this method has two distinctive features. First, it actively probe the customer to get useful information to reach the recommendation, and the information provided by customer will be immediately used by the method to dynamically generate the next questions to probe. This feature ensures that all available information from the customer is used. Second, this method is based on a probabilistic model, and uses a data augmentation method which avoids overfitting when estimating the probabilities in the model. This feature ensures that the method is robust to databases that are incomplete or contain errors. Experimental results verify the effectiveness of our approach. 
KDD2008 workshop report DMMT%2708 data mining using matrices and tensors.

Dynamic detection for computer virus based on immune system.

Clustering with Local and Global Regularization.
Clustering is an old research topic in data mining and machine learning communities. Most of the traditional clustering methods can be categorized local or global ones. In this paper, a novel clustering method that can explore both the local and global information in the dataset is proposed. The method, Clustering with Local and Global Consistency (CLGR), aims to minimize a cost function that properly trades off the local and global costs. We will show that such an optimization problem can be solved by the eigenvalue decomposition of a sparse symmetric matrix, which can be done efficiently by some iterative methods. Finally the experimental results on several datasets are presented to show the effectiveness of our method.
Gene Selection via Matrix Factorization.

A Two%2DStage Gene Selection Algorithm by Combining ReliefF and mRMR.
Abstract—Gene expression data usually contains a large number of genes, but a small number of samples. Feature selection for gene expression data aims at finding a set of genes that best discriminate biological samples of different types. In this paper, we present a two-stage selection algorithm by combining ReliefF and mRMR: In the first stage, ReliefF is applied to find a candidate gene set; In the second stage, mRMR method is applied to directly and explicitly reduce redundancy for selecting a compact yet effective gene subset from the candidate set. We also perform comprehensive experiments to compare the mRMR-ReliefF selection algorithm with ReliefF, mRMR and other feature selection methods using two classifiers as SVM and Naive Bayes, on seven different datasets. The experimental results show that the mRMR-ReliefF gene selection algorithm is very effective. Index Terms—Gene selection algorithms, reliefF, mRMR, mRMR-reliefF.
On the Effectiveness of Constraints Sets in Clustering Genes.

Diva a variance%2Dbased clustering approach for multi%2Dtype relational data.

Statistical Analysis of Full%2DChip Leakage Power Considering Junction Tunneling Leakage.

A New BP Neural Network Model Based on the Random Fuzzy Theory.

Exploration of Network Security Information Hid in Web Pages Based on Immunology.

An Analytical Model for a Book%2DAhead Bandwidth Scheduler.
Abstract — Optical networks with book-ahead bandwidth schedulers are being deployed to meet the high-speed and predictable-service networking requirements of applications in the scientific research community. We present an analytical model for a single-link book-ahead bandwidth scheduler, which responds to advance reservation requests with the first-available time interval in which a channel is available. The link is assumed to be divided into m channels, and time is discretized into intervals. Our proposed model is a non-homogeneous continuous-time Markov chain, which has an embedded discrete-time Markov chain. We solve the model for call congestion, mean scheduling delay, and link utilization. This model can be used by network designers to select the size of the reservation window, K, in timeinterval units, corresponding to a desired set of values for the output metrics, for a given value of m. For example, when m is 8, increasing the reservation window beyond 4 intervals does not affect the call congestion or system utilization, but causes the mean scheduling delay to increase. We show with comparative simulations that our analytical model can be used as a solution for an M/D/m/p queueing system at moderate-to-high loads. I.
Signaling Transport Options in GMPLS Networks In%2Dband or Out%2Dof%2Dband.
Abstract—Signaling protocols for GMPLS networks have been standardized and implemented in switch controllers. Most switch vendors allow for signaling messages to be carried over inband signaling channels as well as through out-of-band networks. In this paper, we compare these two signaling transport options. In carrying out this analysis, we allow for both software-implemented signaling protocol processors, as is common in most offthe-shelf switches today, as well as hardware-accelerated signaling protocol engines. Our motivating application is file transfers, which have high call arrival rates and low call holding times. The resulting high signaling message load makes the question of which signaling transport solution to use important. Network delays are lower in the in-band option given that there are no IP routers on these paths, but the per-channel transmitter rates are lower for in-band channels. To study this tradeoff, we set up queueing models and obtained delay estimates. Our analysis shows that with hardware-accelerated signaling engines, in-band signaling is the better option to keep end-to-end call setup delays low. With software signaling protocol processors, the most significant component is the message processing delay, which is likely to include queueing delays, making the question of in-band or out-of-band transport less important. Index Terms—GMPLS networks, signaling protocols, in-band, out-of-band, hardware acceleration, signaling transport
Binary Matrix Factorization with Applications.
An interesting problem in Nonnegative Matrix Factorization (NMF) is to factorize the matrix X which is of some specific class, for example, binary matrix. In this paper, we extend the standard NMF to Binary Matrix Factorization (BMF for short): given a binary matrix X, we want to factorize X into two binary matrices W,H (thus conserving the most important integer property of the objective matrix X) satisfying X ≈ WH. Two algorithms are studied and compared. These methods rely on a fundamental boundedness property of NMF which we propose and prove. This new property also provides a natural normalization scheme that eliminates the bias of factor matrices. Experiments on both synthetic and real world datasets are conducted to show the competency and effectiveness of BMF. 1.
Solving Consensus and Semi%2Dsupervised Clustering Problems Using Nonnegative Matrix Factorization.

Research of Group Decision Consensus Degree Based on Extended Intuitionistic Fuzzy Set.

Adaptive dimension reduction using discriminant analysis and K%2Dmeans clustering.
We combine linear discriminant analysis (LDA) and K-means clustering into a coherent framework to adaptively select the most discriminative subspace. We use K-means clustering to generate class labels and use LDA to do subspace selection. The clustering process is thus integrated with the subspace selection process and the data are then simultaneously clustered while the feature subspaces are selected. We show the rich structure of the general LDA-Km framework by examining its variants and their relationships to earlier approaches. Extensive experimental results on real-world datasets show the effectiveness of our approach. 1.
Efficient label propagation for interactive image segmentation.

Finding Hotspots in Document Collection.

Application of ADP to Intersection Signal Control.

Robust Neural Networks Control for Uncertain Systems with Time%2DVarying Delays and Sector Bounded Perturbations.

Adaptive Tracking Control for the Output PDFs Based on Dynamic Neural Networks.

Chaos Synchronization Between Unified Chaotic System and Genesio System.

Using Wavelet Domain Workload Execution Characteristics to Improve Accuracy

An Analysis of Microarchitecture Vulnerability to Soft Errors on Simultaneous Multithreaded Architectures.

Artificial Immunity%2DBased Discovery for Popular Information in WEB Pages.

Event summarization for system management.

IMDS intelligent malware detection system.
The proliferation of malware has presented a serious threat to the security of computer systems. Traditional signature-based antivirus systems fail to detect polymorphic and new, previously unseen malicious executables. In this paper, resting on the analysis of Windows API execution sequences called by PE files, we develop the Intelligent Malware Detection System (IMDS) using Objective-Oriented Association (OOA) mining based classification. IMDS is an integrated system consisting of three major modules: PE parser, OOA rule generator, and rule based classifier. An OOA Fast FP-Growth algorithm is adapted to efficiently generate OOA rules for classification. A comprehensive experimental study on a large collection of PE files obtained from the anti-virus laboratory of King-Soft Corporation is performed to compare various malware detection approaches. Promising experimental results demonstrate that the accuracy and efficiency of our IMDS system outperform popular anti-virus software such as Norton AntiVirus and McAfee VirusScan, as well as previous data mining based detection systems which employed Naive Bayes, Support Vector Machine (SVM) and Decision Tree techniques.
A learning framework using Green%27s function and kernel regularization with application to recommender system.

Informed Microarchitecture Design Space Exploration Using Workload Dynamics.

Regularized clustering for documents.
In recent years, document clustering has been receiving more and more attentions as an important and fundamental technique for unsupervised document organization, automatic topic extraction, and fast information retrieval or filtering. In this paper, we propose a novel method for clustering documents using regularization. Unlike traditional globally regularized clustering methods, our method first construct a local regularized linear label predictor for each document vector, and then combine all those local regularizers with a global smoothness regularizer. So we call our algorithm Clustering with Local and Global Regularization (CLGR). We will show that the cluster memberships of the documents can be achieved by eigenvalue decomposition of a sparse symmetric matrix, which can be efficiently solved by iterative methods. Finally our experimental evaluations on several datasets are presented to show the superiorities of CLGR over traditional document clustering methods.
Addressing diverse user preferences in SQL%2Dquery%2Dresult navigation.
Database queries are often exploratory and users often find their queries return too many answers, many of them irrelevant. Existing work either categorizes or ranks the results to help users locate interesting results. The success of both approaches depends on the utilization of user preferences. However, most existing work assumes that all users have the same user preferences, but in real life different users often have different preferences. This paper proposes a two-step solution to address the diversity issue of user preferences for the categorization approach. The proposed solution does not require explicit user involvement. The first step analyzes query history of all users in the system offline and generates a set of clusters over the data, each corresponding to one type of user preferences. When user asks a query, the second step presents to the user a navigational tree over clusters generated in the first step such that the user can easily select the subset of clusters matching his needs. The user then can browse, rank, or categorize the results in selected clusters. The navigational tree is automatically constructed using a cost-based algorithm which considers the cost of visiting both intermediate nodes and leaf nodes in the tree. An empirical study demonstrates the benefits of our approach. Categories and Subject Descriptors
DynaNP %2D A Coarse%2Dgrain Dataflow Network Processor Architecture with Dynamic Configurable Processing Path.

Recommendation model based on opinion diffusion

Modeling and analyzing the spread of active worms based on P2P systems.

Generalized multichannel amplitude%2Dand%2Dphase coded modulation for differential space%2Dtime communications.

Robust joint interference detection and decoding for OFDM%2Dbased cognitive radio systems with unknown interference.

OS%2DAware Branch Prediction Improving Microprocessor Control Flow Prediction for Operating Systems.

A secure mobile communication approach based on information hiding.

An integrated system for building enterprise taxonomies.
Although considerable research has been conducted in the field of hierarchical text categorization, little has been done on automatically collecting labeled corpus for building hierarchical taxonomies. In this paper, we propose an automatic method of collecting training samples to build hierarchical taxonomies. In our method, the category node is initially defined by 
some keywords, the web search engine is then used to construct a small set 
of labeled documents, and a topic tracking algorithm with keyword-based 
content normalization is applied to enlarge the training corpus on the basis 
of the seed documents. We also design a method to check the consistency 
of the collected corpus. The above steps produce a flat category structure which contains all the categories for building the hierarchical taxonomy. 
Next, linear discriminant projection approach is utilized to construct more 
meaningful intermediate levels of hierarchies in the generated flat set of cat- 
egories. Experimental results show that the training corpus is good enough 
for statistical classification methods. 

A new approach to robust and non%2Dfragile Hinfinity control for uncertain fuzzy systems.

Hierarchical document classification using automatically generated hierarchy.

Computer Forensics System Based on Artificial Immune Systems.

Consensus Based Formation Control and Trajectory Tracing of Multi%2DAgent Robot Systems.

Robust stability for neural networks with time%2Dvarying delays and linear fractional uncertainties.

Exponential state estimation for recurrent neural networks with distributed delays.

Further result on asymptotic stability criterion of neural networks with time%2Dvarying delays.

The Fifth International Conference on Machine Learning and Applications

Nonnegative Matrix Factorization and Probabilistic Latent Semantic Indexing Equivalence Chi%2DSquare Statistic

IntClust A Software Package for Clustering Replicated Microarray Data.

Mining the Database of Transcription Binding Sites.

An Immune%2DBased Model for Service Survivability.

SWSDS Quick Web Service Discovery and Composition in SEWSIP.

Recommendation on Item Graphs.
A novel scheme for item-based recommendation is proposed in this paper. In our framework, the items are described by an undirected weighted graph G = (V, E). V is the node set which is identical to the item set, and E is the edge set. Associate with each edge eij ∈ E is a weight wij 0, which represents similarity between items i and j. Without the loss of generality, we assume that any user’s ratings to the items should be sufficiently smooth with respect to the intrinsic structure of the items, i.e., a user should give similar ratings to similar items. A simple algorithm is presented to achieve such a “smooth ” solution. Encouraging experimental results are provided to show the effectiveness of our method. 1.
Biclustering Protein Complex Interactions with a Biclique Finding Algorithm.


The Relationships Among Various Nonnegative Matrix Factorization Methods for Clustering.
The nonnegative matrix factorization (NMF) has been shown recently to be useful for clustering. Various extensions of NMF have also been proposed. In this paper we present an overview and theoretically analyze the relationships among them. In addition, we clarify previously unaddressed issues, such as NMF normalization, cluster posterior probabilty, and NMF algoritm convergence rate. Experiments are also conducted to empirically evaluate and compare various factorization methods.
Integrating Features from Different Sources for Music Information Retrieval.

A Big%2DNeuron Based Expert System.

An Immunity%2DBased Dynamic Multilayer Intrusion Detection System.

Immunity and Mobile Agent Based Grid Intrusion Detection.

NASC A Novel Approach for Spam Classification.

Family Gene Based Grid Trust Model.

Grid Intrusion Detection Based on Immune Agent.

Interval Data Clustering with Applications.
Authors and affiliations are hidden for review purpose Interval data is described by a group of variables, each of which contains a range of continuous values instead of the traditional single continuous or discrete value. Traditional data analysis simply replaces each interval by its representative (e.g., center or mean) and ignores the structure information of intervals. In this paper, we study the problem of clustering interval data using the modified or extended interval data dissimilarity measures. Our contributions are two-fold. First, we discuss various approaches for measuring the dissimilarities/distances between interval data, investigate the relations among them, and present a comprehensive experimental study on clustering interval data. We show that the extended interval data clustering achieves better performance than traditional ones and produces more meaningful and explanatory results. Second, we propose a two-stage approach for clustering interval data by exploiting the relations between the traditional distances and the modified distances. Experimental results show the effectiveness of our approach.
Empirical Studies on Multi%2Dlabel Classification.


OS%2Daware tuning improving instruction cache energy efficiency on system workloads.

An Immune Evolutionary Algorithm Based on Chaos Mutation.

A Goal Programming Based Approach for Hidden Targets in Layer%2Dby%2DLayer Algorithm of Multilayer Perceptron Classifiers.

Computation of Si Nanowire Bandstructures on Parallel Machines Through Domain Decomposition.

Orthogonal nonnegative matrix t%2Dfactorizations for clustering.

Characterizing Microarchitecture Soft Error Vulnerability Phase Behavior.

Immunity and Mobile Agent Based Intrusion Detection for Grid.

Complexity%2Dbased program phase analysis and classification.
Modeling and analysis of program behavior are at the foundation of computer system design and optimization. As computer systems become more adaptive, their efficiency increasingly depends on program dynamic characteristics. Previous studies have revealed that program runtime execution manifests phase behavior. Recently, methods and tools to analyze and classify program phases have also been developed. However, very few studies have been proposed so far to understand and evaluate program phases from their dynamics and complexity perspectives. In this work, we propose new methods, metrics and frameworks which aim to analyze, quantify, and classify the dynamics and complexity of program phases. Our methods use wavelet techniques to represent program phases at multiresolution scales. The cross-correlation coefficients between phase dynamics observed at different scales are then computed as metrics to quantify phase complexity. We propose to apply wavelet-based multiresolution analysis and data clustering to classify program execution into phases that exhibit similar degree of complexity. Experimental results on SPEC CPU 2000 benchmarks show that the proposed schemes classify complexity-based program phases better than currently used approaches.
Immunity and Mobile Agent Based Intrusion Detection for Grid.

Parameter Evolution for Quality of Service in Multimedia Networking.

Immune Multi%2Dagent Active Defense Model for Network Intrusion.

An Immune Mobile Agent Based Grid Intrusion Detection Model.

Immune%2DBased Dynamic Intrusion Response Model.

NMF and PLSI equivalence and a hybrid algorithm.

Searching the web using composed pages.
Databases – Graph Pattern Mining, Ranked search on graph databases and various domains
Role of index bonds in an optimal dynamic asset allocation model with real subsistence consumption.

Output feedback H INFINITY  control for uncertain discrete%2Dtime hyperbolic fuzzy systems.

Robust multiuser detection for multicarrier CDMA systems.

Toward intelligent music information retrieval.

Analysis of a polling system for telephony traffic with application to wireless LANs.

Low complexity iterative decoding for bit%2Dinterleaved coded modulation.

Using discriminant analysis for multi%2Dclass classification an experimental investigation.

A Unified View on Clustering Binary Data.
Clustering is the problem of identifying the distribution of patterns and intrinsic correlations in large data sets by partitioning the data points into similarity classes. This paper studies the problem of clustering binary data. Binary data have been oc-cupying a special place in the domain of data analysis. A unified view of binary data clustering is presented by examining the connections among various clustering crite-ria. Experimental studies are conducted to empirically verify the relationships. 1
Operating system power minimization through run%2Dtime processor resource adaptation.

BASS a benchmark suite for evaluating architectural security systems.

KDD%2D2006 workshop report Theory and Practice of Temporal Data Mining.

PromPredictor A Hybrid Machine Learning System for Recognition and Location of Transcription Start Sites in Human Genome.

Approximate Global Alignment of Sequences.
We propose two novel dynamic programming (DP) methods that solve the the approximate bounded and unbounded global alignment problems for biological sequences. Our first method solves the bounded alignment problem. It computes the distribution of the edit distance between the remaining suffixes. For a given bound k and approximation p %, it uses this distribution to prune the entries of the DP matrix that will lead to alignments with more than k edit operations with more than p % probability. Our second method addresses the unbounded global alignment problem. For each entry of the distance matrix, it dynamically computes an upper bound to the distance between the unaligned suffixes. This bound, along with the lower bound as computed for the bounded case, is then used to eliminate the entries of the distance matrix. According to our experimental results, our methods are up to three times faster than the competing methods for the bounded alignment and up to two times faster for the unbounded alignment, even with 100 % approximation. Our methods use only 17-68 % of the space used by the next best competitor. 1
An Immune%2DBased Model for Computer Virus Detection.

A New Model for Dynamic Intrusion Detection.

Clustering Genes Using Gene Expression and Text Literature Data.

A Clustering Model Based on Matrix Approximation with Applications to Cluster System Log Files.
Abstract. In system management applications, to perform automated analysis of the historical data across multiple components when problems occur, we need to cluster the log messages with disparate formats to automatically infer the common set of semantic situations and obtain a brief description for each situation. In this paper, we propose a clustering model where the problem of clustering is formulated as matrix approximations and the clustering objective is minimizing the approximation error between the original data matrix and the reconstructed matrix based on the cluster structures. The model explicitly characterizes the data and feature memberships and thus enables the descriptions of each cluster. We present a two-side spectral relaxation optimization procedure for the clustering model. We also establish the connections between our clustering model with existing approaches. Experimental results show the effectiveness of the proposed approach.
Mining Logs Files for Computing System Management.
With advancement in science and technology, computing systems are becoming increasingly more complex with an increasing variety of heterogeneous software and hardware components. They are thus becoming increasingly more difficult to monitor, manage and maintain. Traditional approaches to system management have been largely based on domain experts through a knowledge acquisition process that translates domain knowledge into operating rules and policies. This has been well known and experienced as a cumbersome, labor intensive, and error prone process. In addition, this process is difficult to keep up with the rapidly changing environments. There is thus a pressing need for automatic and efficient approaches to monitor and manage complex computing systems. A popular approach to system management is based on analyzing system log files. However, some new aspects of the log files have been less emphasized in existing methods from data mining and machine learning community. The various formats and relatively short text messages of log files, and temporal characteristics in data representation pose new challenges. In this paper, we will describe our research efforts to address those challenges. In particular, we apply text mining techniques to categorize messages in log files into common situations, improve categorization accuracy by considering the temporal characteristics of log messages, and utilize visualization tools to discover, evaluate and validate the interesting temporal patterns for system management. 1.
Bioinformatics on Embedded Systems A Case Study of Computational Biology Applications on VLIW Architecture.
Abstract. Bioinformatics applications represent the increasingly important workloads. Their characteristics and implications on the underlying hardware design, however, are largely unknown. Currently, biological data processing ubiquitously relies on the high-end systems equipped with expensive, generalpurpose processors. The future generation of bioinformatics requires the more flexible and cost-effective computing platforms to meet its rapidly growing market. The programmable, application-specific embedded systems appear to be an attractive solution in terms of easy of programming, design cost, power, portability and time-to-market. The first step towards such systems is to characterize bioinformatics applications on the target architecture. Such studies can help in understanding the design issues and the trade-offs in specializing hardware and software systems to meet the needs of bioinformatics market. This paper evaluates several representative bioinformatics tools on the VLIW based embedded systems. We investigate the basic characteristics of the benchmarks, impact of function units, the efficiency of VLIW execution, cache behavior and the impact of compiler optimizations. The architectural implications observed from this study can be applied to the design optimizations. To the best of our knowledge, this is one of the first such studies that have ever been attempted. 1.
A Weather Forecast System Based on Artificial Immune System.

A New Model of Immune%2DBased Network Surveillance and Dynamic Computer Forensics.

A Knowledge%2DDriven Method to Evaluate Multi%2Dsource Clustering.

Fault%2DTolerant Routing Algorithm for RDT Structure.

Fault%2DTolerant Routing Schemes in RDT%282
It has been well recognized that the fault-tolerance capability is vital for a NoC system, since one faulty link/processor may isolate a large fraction of processors. Continuing from a previous paper [13] where a RDT(2,2,1)/α-based interconnection network for NoC designs was proposed, in this paper, we investigate fault-tolerant routing schemes on NoC systems featuring a RDT-based interconnection network. In specific, we propose two fault-tolerant routing schemes in the presence of either single link/node failure or multiple link/node failures. The proposed routing schemes are based on deterministic routing. Alternative routes are discovered by properly selecting the intermediate nodes between the source and the destination nodes on the rank tori. As of the single link/node failure case, we show that the number of routers on the detoured route generated by the proposed routing scheme is at most 2 more than the number of routers on the original route. 1.
A general model for clustering binary data.

An integrated framework on mining logs files for computing system management.
Traditional approaches to system management have been largely based on domain experts through a knowledge acquisition process that translates domain knowledge into operating rules and policies. This has been well known and experienced as a cumbersome, labor intensive, and error prone process. In addition, this process is difficult to keep up with the rapidly changing environments. In this paper, we will describe our research efforts on establishing an integrated framework for mining system log files for automatic management. In particular, we apply text mining techniques to categorize messages in log files into common situations, improve categorization accuracy by considering the temporal characteristics of log messages, develop temporal mining techniques to discover the relationships between different events, and utilize visualization tools to evaluate and validate the interesting temporal patterns for system management.
Workload Characterization of Bioinformatics Applications.
The exponential growth in the amount of genomic information has spurred growing interest in large scale analysis of genetic data. Bioinformatics applications represent the increasingly important workloads. However, very few results on the behavior of these applications running on the state-of-the-art microprocessor and systems have been published. This paper proposes a suite of widely used bioinformatics applications and studies the execution characteristics of these benchmarks on a representative architecture – the Intel Pentium 4. To understand the impacts and implications of bioinformatics workloads on the microprocessor designs, we contrast the characteristics of bioinformatics workloads and the widely used SPEC 2000 integer benchmarks. The proposed bioinformatics benchmark suite as well as the input datasets can be downloaded from the following website:
Hierarchical Document Classification Using Automatically Generated Hierarchy.

On Clustering Binary Data.

Wavelet Methods in Data Mining.
Recently there has been significant development in the use of wavelet methods in various Data Mining processes. This article presents general overview of their applications in Data Mining. It first presents a high-level data-mining framework in which the overall process is divided into smaller components. It reviews a p plications of wavelets for each component. It discusses the impact of wavelets on Data Mining research and outlines potential future research directions and applications. Keywords:
Robust stabilization for delayed discrete%2Dtime fuzzy systems via basis%2Ddependent Lyapunov%2DKrasovskii function.

Semisupervised learning from different information sources.

Mining logs files for data%2Ddriven system management.
are becoming increasingly more complex with an increasing variety of heterogeneous software and hardware components. They are thus becoming increasingly more difficult to monitor, manage and maintain. Traditional approaches to system management have been largely based on domain experts through a knowledge acquisition process that translates domain knowledge into operating rules and policies. This has been well known and experienced as a cumbersome, labor intensive, and error prone process. In addition, this process is difficult to keep up with the rapidly changing environments. There is thus a pressing need for automatic and efficient approaches to monitor and manage complex computing systems. A popular approach to system management is based on analyzing system log files. However, some new aspects of the log files have been less emphasized in existing methods from data mining and machine learning community. The various formats and relatively short text messages of log files, and temporal characteristics in data representation pose new challenges. In this paper, we will describe our research efforts on mining system log files for automatic management. In particular, we apply text mining techniques to categorize messages in log files into common situations, improve categorization accuracy by considering the temporal characteristics of log messages, and utilize visualization tools to evaluate and validate the interesting temporal patterns for system management.
Adapting branch%2Dtarget buffer to improve the target predictability of java code.
Java programs are increasing in popularity and prevalence on  numerous platforms, including high-performance general-purpose processors.
Music artist style identification by semi%2Dsupervised learning from both lyrics and content.

Semi%2Dsupervised learning for music artists style identification.

On combining multiple clusterings.
Three methods for combining multiple clustering systems are presented and evaluated, focusing on the problem of finding the correspondence between clusters of di#erent systems. In this work, the clusters of individual systems are represented in a common space and their correspondence estimated by either &#034;clustering clusters&#034; or with Singular Value Decomposition. The approaches are evaluated for the task of topic discovery on three major corpora and eight di#erent clustering algorithms and it is shown experimentally that combination schemes almost always o#er gains compared to single systems, but gains from using a combination scheme depend on the underlying clustering systems.
Mining Temporal Patterns Without Predefined Time Windows.

Entropy%2Dbased criterion in categorical clustering.
Entropy-type measures for the heterogeneity of  clusters have been used for a long time. This  paper studies the entropy-based criterion in clustering  categorical data. It first shows that the  entropy-based criterion can be derived in the formal  framework of probabilistic clustering models  and establishes the connection between the criterion  and the approach based on dissimilarity coefficients.
Practical Routing and Torus Assignment for RDT.

IFD Iterative Feature and Data Clustering.
In this paper, we propose a new clustering algorithm, IFD 1, based on a cluster model of data coefficients D and feature coefficients F. The coefficients denote the degree (or weights) of the data and features associated with the clusters. Clustering is performed via an iterative optimization procedure to mutually reinforce the relationships between the coefficients. The mutually reinforcing optimization exploits the duality of the data and features and enable a simultaneous clustering of both data and features. We have shown the convergence property of the clustering algorithm and discussed its connections with various existential approaches. Extensive experimental results on both synthetic and real data sets show the effectiveness of IFD algorithm.
Document clustering via adaptive subspace iteration.

A comparative study of feature selection and multiclass classification methods for tissue classification based on gene expression.
This paper studies the problem of building multiclass classifiers for tissue classification based on gene expression. The recent development of microarray technologies has enabled biologists to quantify gene expression of tens of thousands of genes in a single experiment. Biologists have begun collecting gene expression for a large number of samples. One of the urgent issues in the use of microarray data is to develop methods for characterizing samples based on their gene expression. The most basic step in the research direction is binary sample classification, which has been studied extensively over the past few years. This paper investigates the next step—multiclass classification of samples based on gene expression. The characteristics of expression data (e.g., large number of genes with small sample size)
Code%2Dtiming estimation for CDMA systems with bandlimited chip waveforms.


Using Uncorrelated Discriminant Analysis for Tissue Classification with Gene Expression Data.
Abstract—The classification of tissue samples based on gene expression data is an important problem in medical diagnosis of diseases such as cancer. In gene expression data, the number of genes is usually very high (in the thousands) compared to the number of data samples (in the tens or low hundreds); that is, the data dimension is large compared to the number of data points (such data is said to be undersampled). To cope with performance and accuracy problems associated with high dimensionality, it is commonplace to apply a preprocessing step that transforms the data to a space of significantly lower dimension with limited loss of the information present in the original data. Linear Discriminant Analysis (LDA) is a well-known technique for dimension reduction and feature extraction, but it is not applicable for undersampled data due to singularity problems associated with the matrices in the underlying representation. This paper presents a dimension reduction and feature extraction scheme, called Uncorrelated Linear Discriminant Analysis (ULDA), for undersampled problems and illustrates its utility on gene expression data. ULDA employs the Generalized Singular Value Decomposition method to handle undersampled data and the features that it produces in the transformed space are uncorrelated, which makes it attractive for gene expression data. The properties of ULDA are established rigorously and extensive experimental results on gene expression data are presented to illustrate its effectiveness in classifying tissue samples. These results provide a comparative study of various state-of-the-art classification methods on well-known gene expression data sets. Index Terms—Microarray data analysis, discriminant analysis, generalized singular value decomposition, classification. 1
Efficient multi%2Dway text categorization via generalized discriminant analysis.

Using Discriminant Analysis for Multi%2Dclass Classification.

Routine based OS%2Daware microprocessor resource adaptation for run%2Dtime operating system power saving.
The increasingly constrained power budget of today&#039;s microprocessor has resulted in a situation where power savings of all components in a system have to be taken into consideration. Operating System (OS) is a major power consumer in many modern applications execution. This paper advocates a routine based OS-aware microprocessor resource adaptation mechanism targeting run-time OS power savings. Simulation results show that compared with the existing sampling-based adaptation schemes, this novel methodology yields more attractive power and performance trade-off on the OS execution. To our knowledge, this paper is the first step to address the power saving issue of the OS itself, an increasingly important area that has been largely overlooked in the previous studies.
Detecting emotion in music.
Introduction  Music is not only for entertainment and for pleasure, but has been used for a wide range of purposes due to its social and physiological effects. Traditionally musical information has been retrieved and/or classified based on standard reference information, such as the name of the composer and the title of the work etc. These basic pieces information will remain essential, but information retrieval based on these are far from satisfactory. Huron points out that since the preeminent functions of music are social and psychological, the most useful characterization would be based on four types of information: the style, emotion, genre, and similarity [Huron,2000].  The relation between musical sounds and their influence on the listener&#039;s emotion has been well studied. The celebrated paper of Hevner [Hevner,1936] studied this relation through experiments in which the listeners are asked to write adjectives that came to their minds as the most descriptive of the music played. 
A New Distributed Data Mining Model Based on Similarity.
Distributed Data Mining(DDM) has been very active and enjoying a growing amount attention since its inception. Current DDM techniques regard the distributed data sets as a single virtual table and assume there exists a global model which could be generated if the data were combined/centralized. This paper proposes a similaritybased distributed data mining(SBDDM) framework which explicitly take the differences among distributed sources into consideration. A new similarity measure is introduced and its effectiveness is then evaluated and validated. This paper also illustrates the limitations of current DDM techniques through three concrete case studies. Finally distributed clustering within the SBDDM framework is also discussed.

A Framework of Individually%2DFocused Teleconferencing %28IFT%29 via an Efficient 3D Reprojection Technique.

A comparative study on content%2Dbased music genre classification.
Content-based music genre classification is a fundamental component of music information retrieval systems and has been gaining importance and enjoying a growing amount of attention with the emergence of digital music on the Internet. Currently little work has been done on automatic music genre classification, and in addition, the reported classification accuracies are relatively low. This paper proposes a new feature extraction method for music genre classification, DWCHs 1. DWCHs capture the local and global information of music signals simultaneously by computing histograms on their Daubechies wavelet coefficients. Effectiveness of this new feature and of previously studied features are compared using various machine learning classification algorithms, including Support Vector Machines and Linear Discriminant Analysis. It is demonstrated that the use of DWCHs significantly improves the accuracy of music genre classification.
Topic hierarchy generation via linear discriminant projection.

Run%2Dtime modeling and estimation of operating system power consumption.
The increasing constraints on power consumption in many computing systems point to the need for power modeling and estimation for all components of a system. The Operating System (OS) dissipates a significant portion of total power in many modern application executions. Therefore, modeling OS power is imperative for accurate software power estimation, as well as power management (e.g. dynamic thermal control and battery-life prediction) in the light of the OSintensive workloads. This paper characterizes the power behavior of a commercial OS to understand the energy consumption profiles then proposes various models to cost-effectively estimate the OS energy consumption at run time. The proposed models rely on a few simple parameters and have various degrees of complexity and accuracy. Experiments show that compared with cycle accurate full system simulation, the model can predict OS energy consumption to within 1% accuracy for a set of benchmark programs evaluated on a high-end superscalar microprocessor. The most striking observation is the strong correlation between power consumption and the instructions per cycle (IPC) during program execution. Since tools and methodology to measure IPC exist on modern microprocessors, the proposed models can estimate OS energy for run-time dynamic thermal and energy management.
Association%2Dbased similarity testing and its applications.
This paper proposes a new similarity measure between basket datasets based on associations. The new measure is calculated from support counts using a formula inspired by information entropy. Experiments on both real and synthetic datasets show the effectiveness of the measure. This paper then investigates the applications of the similarity measure. It first studies the problem of finding a mapping between categorical database attribute sets using similarity measures. A generic approach for identifying such a mapping is proposed. The approach is implemented based on the similarity measure proposed in the paper and its performance has been evaluated and validated. Moreover, this paper also explores the applications of using the similarity measure to mine distributed datasets.
Algorithms for clustering high dimensional and distributed data.
Clustering is the problem of identifying the distribution of patterns and intrinsic correlations in large data sets by partitioning the data points into similarity classes. The clustering problem has been widely studied in machine learning, databases, and statistics. This paper studies the problem of clustering high dimensional data. The paper proposes an algorithm called the CoFD algorithm, which is a non-distance based clustering algorithm for high dimensional spaces. Based on the
Understanding and improving operating system effects in control flow prediction.
Many modern applications exercise the operating system kernel significantly, resulting in several implications including affecting the control flow transfer in the execution environment. This paper focuses on understanding the operating system effects on control flow transfer and prediction, and designing architectural support to alleviate the bottlenecks.
Estimating Joint Probabilities from Marginal Ones.
This paper explores the implications of approximating a concept based on the Bayesian decision procedure, which provides a plausible unification of the fuzzy set and rough set approaches for approximating a concept. We show that if a given concept is approximated by one set, the same result given by the α-cut in the fuzzy set theory is obtained. On the other hand, if a given concept is approximated by two sets, we can derive both the algebraic and probabilistic rough set approximations. Moreover, based on the well known principle of maximum (minimum) entropy, we give a useful interpretation of fuzzy intersection and union. Our results enhance the understanding and broaden the applications of both fuzzy and rough sets. 1.
CoFD  An Algorithm for Non%2Ddistance Based Clustering in High Dimensional Spaces.

Using Complete Machine Simulation for Software Power Estimation The SoftWatt Approach.
Power dissipation has become one of the most critical factors for the continued development of both high-end and low-end computer systems. The successful design and evaluation of power optimization techniques to address this vital issue is invariably tied to the availability of a broad and accurate set of simulation tools. Existing power simulators are mainly targeted for particular hardware components such as CPU or memory systems and do not capture the interaction between different system components. In this work, we present a complete system power simulator, called SoftWatt, that models the CPU, memory hierarchy and a low-power disk subsystem and quantifies the power behavior of both the application and operating system. This tool, built on top of the SimOS infrastructure, uses validated analytical energy models to identify the power hotspots in the system components, capture relative contributions of the user and kernel code to the system power profile, identify the power-hungry operating system services and characterize the variance in kernel power profile with respect to workload. Our results using Spec JVM98 benchmark suite emphasize the importance of complete system simulation to understand the power impact of architecture and operating system on application execution. 1
Rehashable BTB An Adaptive Branch Target Buffer to Improve the Target Predictability of Java Code.
Java programs are increasing in popularity and prevalence on  numerous platforms, including high-performance general-purpose processors.
Improving Medical%2FBiological Data Classification Performance by Wavelet Preprocessing.
Many real-world datasets contain noise and noise could degrade the performances of learning algorithms. Motivated from the success of wavelet denoising techniques in image data, we explore a general solution to alleviate the eect of noisy data by wavelet preprocessing for medical/biological data classi  cation. Our experiments are divided into two categories: one is of dierent classi  cation algorithms  on a speci  c database (Ecoli [6]) and the other is of a speci  c classi  cation algorithm (decision tree) on dierent databases. The experiment results show that the wavelet denoising of noisy data is able to improve the accuracies of those classi  cation methods, if the localities of the attributes are strong enough.
Modeling and Evaluation of Control Flow Prediction Schemes Using Complete System Simulation and Java Workloads.

PGAAS a prokaryotic genome assembly assistant system.

Robust design based on constraint networks.

A Survey on Wavelet Applications in Data Mining.
Recently there has been significant development in the use of wavelet methods in various data mining processes. However, there has been written no comprehensive survey available on the topic. The goal of this is paper to fill the void. First, the paper presents a high-level data-mining framework that reduces the overall process into smaller components. Then applications of wavelets for each component are reviewd. The paper concludes by discussing the impact of wavelets on data mining research and outlining potential future research directions and applications.
PGAAS A prokaryotic genome assembly assistant system.

Instruction Balance and Its Relation to Program Energy Consumption.
A computer consists of multiple components such as functional  units, cache and main memory. At each moment of execution, a  program may have a varied amount of work for each component. Recent  development has exploited this imbalance to save energy by slowing the  components that have a lower load. Example techniques include dynamic  scaling and clock gating used in processors from Transmeta and Intel.
ADir%5FpNB A Cost%2DEffective Way to Implement Full Map Directory%2DBased Cache Coherence Protocols.

The Denotational Semantics of NIPL.

Routing and Re%2DRouting in a LEO%2FMEO Two%2Dtier Mobile Satellite Communications System with Inter%2DSatellite Links.

Using complete system simulation to characterize SPECjvm98 benchmarks.
Complete system simulation to understand the influence of architecture and operating systems on application execution has been identified to be crucial for systems design. While there have been previous attempts at understanding the architectural impact of Java programs, there has been no prior work investigating the operating system (kernel) activity during their executions. This problem is particularly interesting in the context of Java since it is not only the application that can invoke kernel services, but so does the underlying Java Virtual Machine (JVM) implementation which runs these programs. Further, the JVM style (JIT compiler or interpreter) and the manner in which the different JVM components (such as the garbage collector and class loader) are exercised, can have a significant impact on the kernel activities. To investigate these issues, this research uses complete system
An Intelligent Neural Network Programming System %28NNPS%29.

Low Resolution 3D Reconstructions of Viruses from X%2DRay Crystal Diffraction Data.

A multimedia%2Dbased intelligent configurator for network access equipment.

Holistic Approach for Problem Improvement in Health Education A Human Centred Basis. A Case Study on AIDS Prevention and Control at a Chinese Medical School.

A Versatile Directory Scheme%28Dir2NB L%29 and Its Implementation on BY91%2D1 Multiprocessors System.

Topological Feature Maps on Parallel Computers.

A structure%2Dparameter%2Dadaptive %28SPA%29 neural tree for the recognition of large character set.

A Rule%2Dbased and Object%2DOriented AI Programming Language.

Hierarchical classification and vector quantization with neural trees.

A Connectionist Approach to Vertex Covering Problems.

Parallel Imprecise Iterative Deepening for Combinatorial Optimization.

Competition and Cooperation in Analog Neural Networks for Combinatorial Optimization %28Abstract%29.

Design of Competition%2DBased Neural Networks for Combinatorial Optimization.

Algorithms for the Parallel Execution of Rule%2DBased Expert Systems.

Parallel implementation of rule%2Dbased expert systems for interactive applications.

CODAR General purpose design tool for rule%2Dbased engineering expert systems.

